On the spanning connectivity and spanning laceability of hypercube-like networks
نویسندگان
چکیده
منابع مشابه
On the spanning connectivity and spanning laceability of hypercube-like networks
Let u and v be any two distinct nodes of an undirected graph G, which is k-connected. For 1 ≤ w ≤ k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A w-container C(u, v) of G is a w-container if it contains all the nodes of G. A graph G is w-connected if there exists a w-container between any two distinct nodes. A bipartite graph G is w-laceable if ...
متن کاملThe spanning laceability on the faulty bipartite hypercube-like networks
a Institute of Information Science, Academia Sinica, Taipei City 11529, Taiwan, ROC Department of Computer Science and Information Engineering, Hungkuang University, Taichung City 433, Taiwan, ROC Department of Computer Science, National Chiao Tung University, Hsinchu 30010, Taiwan, ROC Department of Computer Science and Information Engineering, Providence University, Taichung City 433, Taiwan,...
متن کاملSpanning Connectivity of the WK-Recursive Networks
A k-container C(u, v) of G between u and v is a set of k internally disjoint paths between u and v. A k-container C(u, v) of G is a k∗-container if it contains all vertices of G. A graph G is k∗connected if there exists a k∗-container between any two distinct vertices. The spanning connectivity of G, κ∗(G), is defined to be the largest integer k such that G is w∗-connected for all 1 ≤ w ≤ k if ...
متن کاملOn the spanning fan-connectivity of graphs
Let G be a graph. The connectivity of G, κ(G), is the maximum integer k such that there exists a k-container between any two different vertices. A k-container of G between u and v, Ck(u, v), is a set of k-internally-disjoint paths between u and v. A spanning container is a container that spans V (G). A graph G is k-connected if there exists a spanning k-container between any two different verti...
متن کاملThe Spanning Fan-connectivity and the Spanning Pipeline-connectivity of Graphs∗
Let G be a graph. The connectivity of G, κ(G), is the maximum integer k such that there exists a k-container between any two different vertices. A k-container of G between u and v, Ck(u, v), is a set of k-internally disjoint paths between u and v. A spanning container is a container that spans V (G). A graph G is k∗-connected if there exists a spanning k-container between any two different vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.05.002